package com.xigua._递归;

/**
 * @author LiRongHua
 * @Title: ${file_name}
 * @Package ${package_name}
 * @Description: ${todo}
 * @date 2022/3/2722:44
 */
public class _746_使用最小花费爬楼梯 {

    public static void main(String[] args) {
        int cost[] = new int[]{1,100,1,1,1,100,1,1,100,1};
        minCostClimbingStairs(cost);
    }

    public static int minCostClimbingStairs(int[] cost) {
        int length = cost.length;
        int dp[] = new int[length+1];
        dp[0]=0;
        dp[1] = 0;
        for (int i = 2; i <=length; i++) {
            dp[i] = Math.min(dp[i-2]+cost[i-2],dp[i-1]+cost[i-1]);
        }
        return dp[length];
    }



}
